/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:33:26,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:33:26,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:33:26,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:33:26,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:33:26,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:33:26,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:33:26,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:33:26,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:33:26,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:33:26,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:33:26,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:33:26,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:33:26,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:33:26,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:33:26,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:33:26,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:33:26,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:33:26,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:33:26,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:33:26,437 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:33:26,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:33:26,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:33:26,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:33:26,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:33:26,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:33:26,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:33:26,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:33:26,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:33:26,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:33:26,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:33:26,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:33:26,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:33:26,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:33:26,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:33:26,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:33:26,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:33:26,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:33:26,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:33:26,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:33:26,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:33:26,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:33:26,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:33:26,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:33:26,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:33:26,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:33:26,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:33:26,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:33:26,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:33:26,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:33:26,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:33:26,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:33:26,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:33:26,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:33:26,472 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:33:26,473 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 19:33:26,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:33:26,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:33:26,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:33:26,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:33:26,647 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:33:26,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound1.c [2022-04-07 19:33:26,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc52bfa04/991a5316cd31437c9e5cc561c9393e56/FLAG14f679e98 [2022-04-07 19:33:27,083 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:33:27,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound1.c [2022-04-07 19:33:27,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc52bfa04/991a5316cd31437c9e5cc561c9393e56/FLAG14f679e98 [2022-04-07 19:33:27,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc52bfa04/991a5316cd31437c9e5cc561c9393e56 [2022-04-07 19:33:27,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:33:27,105 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:33:27,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:33:27,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:33:27,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:33:27,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a44aca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27, skipping insertion in model container [2022-04-07 19:33:27,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:33:27,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:33:27,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound1.c[712,725] [2022-04-07 19:33:27,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:33:27,312 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:33:27,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire1_unwindbound1.c[712,725] [2022-04-07 19:33:27,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:33:27,336 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:33:27,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27 WrapperNode [2022-04-07 19:33:27,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:33:27,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:33:27,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:33:27,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:33:27,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:33:27,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:33:27,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:33:27,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:33:27,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:33:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:33:27,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 19:33:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:33:27,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:33:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:33:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:33:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:33:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:33:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:33:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:33:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:33:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:33:27,477 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:33:27,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:33:27,592 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:33:27,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:33:27,597 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 19:33:27,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:27 BoogieIcfgContainer [2022-04-07 19:33:27,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:33:27,599 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:33:27,599 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:33:27,599 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:33:27,602 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:27" (1/1) ... [2022-04-07 19:33:27,604 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:33:27,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:33:27 BasicIcfg [2022-04-07 19:33:27,637 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:33:27,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:33:27,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:33:27,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:33:27,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:33:27" (1/4) ... [2022-04-07 19:33:27,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572bafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:33:27, skipping insertion in model container [2022-04-07 19:33:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:33:27" (2/4) ... [2022-04-07 19:33:27,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572bafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:33:27, skipping insertion in model container [2022-04-07 19:33:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:33:27" (3/4) ... [2022-04-07 19:33:27,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572bafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:33:27, skipping insertion in model container [2022-04-07 19:33:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:33:27" (4/4) ... [2022-04-07 19:33:27,646 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound1.cJordan [2022-04-07 19:33:27,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:33:27,649 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:33:27,689 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:33:27,706 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 19:33:27,706 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:33:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 19:33:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 19:33:27,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:27,726 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:27,726 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-07 19:33:27,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:27,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911983125] [2022-04-07 19:33:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:33:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:27,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 19:33:27,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 19:33:27,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 19:33:27,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:33:27,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 19:33:27,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 19:33:27,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 19:33:27,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 19:33:27,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L32-3: Formula: (and (= v_main_~r~0_1 0) (= v_main_~a~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~a~0] {25#true} is VALID [2022-04-07 19:33:27,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L32-3-->L32-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 19:33:27,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L32-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_~convertDOUBLEToINT_7 0) 1 0)) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[v_~convertDOUBLEToINT_7] AssignedVars[__VERIFIER_assert_#in~cond] {26#false} is VALID [2022-04-07 19:33:27,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-07 19:33:27,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 19:33:27,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 19:33:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:33:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:33:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911983125] [2022-04-07 19:33:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911983125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:33:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:33:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:33:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533348419] [2022-04-07 19:33:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:33:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 19:33:27,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:33:27,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:27,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:27,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:33:27,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:33:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:33:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:33:27,952 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,027 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 19:33:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:33:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 19:33:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:33:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 19:33:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 19:33:28,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-07 19:33:28,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:28,076 INFO L225 Difference]: With dead ends: 23 [2022-04-07 19:33:28,077 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 19:33:28,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:33:28,080 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:33:28,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:33:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 19:33:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-07 19:33:28,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:33:28,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,099 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,099 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,102 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 19:33:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 19:33:28,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:28,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:28,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 19:33:28,103 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 19:33:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,105 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 19:33:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 19:33:28,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:28,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:28,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:33:28,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:33:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 19:33:28,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-07 19:33:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:33:28,108 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 19:33:28,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 19:33:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:33:28,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:28,109 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:28,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:33:28,109 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-07 19:33:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:28,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543452165] [2022-04-07 19:33:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:28,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:33:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:33:28,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114#(= ~counter~0 0)} {109#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {109#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:33:28,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#(= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114#(= ~counter~0 0)} {109#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {114#(= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {114#(= ~counter~0 0)} [61] mainENTRY-->L32-3: Formula: (and (= v_main_~r~0_1 0) (= v_main_~a~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~a~0] {114#(= ~counter~0 0)} is VALID [2022-04-07 19:33:28,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#(= ~counter~0 0)} [64] L32-3-->L32-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {115#(= |main_#t~post5| 0)} is VALID [2022-04-07 19:33:28,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {115#(= |main_#t~post5| 0)} [66] L32-1-->L32-4: Formula: (not (< |v_main_#t~post5_2| 1)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {110#false} is VALID [2022-04-07 19:33:28,170 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#false} [65] L32-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_~convertDOUBLEToINT_7 0) 1 0)) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[v_~convertDOUBLEToINT_7] AssignedVars[__VERIFIER_assert_#in~cond] {110#false} is VALID [2022-04-07 19:33:28,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#false} [69] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {110#false} is VALID [2022-04-07 19:33:28,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#false} [72] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-07 19:33:28,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#false} [76] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-07 19:33:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:33:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:33:28,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543452165] [2022-04-07 19:33:28,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543452165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:33:28,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:33:28,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:33:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47681781] [2022-04-07 19:33:28,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:33:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:33:28,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:33:28,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:28,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:33:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:33:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:33:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:33:28,184 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,259 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 19:33:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:33:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 19:33:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:33:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-07 19:33:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-07 19:33:28,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-07 19:33:28,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:33:28,279 INFO L225 Difference]: With dead ends: 19 [2022-04-07 19:33:28,280 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 19:33:28,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:33:28,281 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:33:28,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:33:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 19:33:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 19:33:28,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:33:28,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,284 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,284 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,285 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 19:33:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 19:33:28,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:28,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:28,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 19:33:28,287 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 19:33:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:33:28,289 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 19:33:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 19:33:28,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:33:28,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:33:28,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:33:28,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:33:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:33:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-07 19:33:28,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-07 19:33:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:33:28,293 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-07 19:33:28,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 19:33:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 19:33:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 19:33:28,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:33:28,294 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:33:28,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 19:33:28,295 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:33:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:33:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-07 19:33:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:33:28,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643246349] [2022-04-07 19:33:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:33:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:33:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:33:28,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:33:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:33:28,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:33:28,356 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:33:28,357 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:33:28,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 19:33:28,360 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 19:33:28,362 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:33:28,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:33:28 BasicIcfg [2022-04-07 19:33:28,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:33:28,383 INFO L158 Benchmark]: Toolchain (without parser) took 1277.15ms. Allocated memory is still 196.1MB. Free memory was 145.6MB in the beginning and 162.9MB in the end (delta: -17.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:28,383 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:28,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.92ms. Allocated memory is still 196.1MB. Free memory was 145.3MB in the beginning and 172.9MB in the end (delta: -27.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-07 19:33:28,384 INFO L158 Benchmark]: Boogie Preprocessor took 40.01ms. Allocated memory is still 196.1MB. Free memory was 172.9MB in the beginning and 171.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:33:28,388 INFO L158 Benchmark]: RCFGBuilder took 220.12ms. Allocated memory is still 196.1MB. Free memory was 171.2MB in the beginning and 161.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 19:33:28,388 INFO L158 Benchmark]: IcfgTransformer took 38.41ms. Allocated memory is still 196.1MB. Free memory was 161.0MB in the beginning and 159.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:33:28,389 INFO L158 Benchmark]: TraceAbstraction took 743.41ms. Allocated memory is still 196.1MB. Free memory was 159.2MB in the beginning and 162.9MB in the end (delta: -3.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:33:28,392 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.92ms. Allocated memory is still 196.1MB. Free memory was 145.3MB in the beginning and 172.9MB in the end (delta: -27.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.01ms. Allocated memory is still 196.1MB. Free memory was 172.9MB in the beginning and 171.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 220.12ms. Allocated memory is still 196.1MB. Free memory was 171.2MB in the beginning and 161.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 38.41ms. Allocated memory is still 196.1MB. Free memory was 161.0MB in the beginning and 159.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 743.41ms. Allocated memory is still 196.1MB. Free memory was 159.2MB in the beginning and 162.9MB in the end (delta: -3.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; VAL [\old(counter)=53, counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [\old(counter)=0, a=50, counter=0, r=0] [L32] EXPR counter++ VAL [\old(counter)=0, a=50, counter=1, counter++=0, r=0] [L32] COND TRUE counter++<1 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 40 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-07 19:33:28,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...