./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:09:19,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:09:19,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:09:19,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:09:19,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:09:19,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:09:19,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:09:19,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:09:19,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:09:19,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:09:19,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:09:19,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:09:19,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:09:19,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:09:19,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:09:19,437 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:09:19,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:09:19,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:09:19,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:09:19,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:09:19,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:09:19,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:09:19,441 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:09:19,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:09:19,442 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:09:19,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:09:19,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:09:19,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:09:19,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:19,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:09:19,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:09:19,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:09:19,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:09:19,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:09:19,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:09:19,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:09:19,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:09:19,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:09:19,469 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:09:19,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2023-11-06 22:09:19,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:09:19,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:09:19,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:09:19,888 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:09:19,889 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:09:19,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-06 22:09:23,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:09:23,385 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:09:23,386 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-06 22:09:23,402 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/data/8046a0322/f24bf5e9ab544c55b0b5006beda3a461/FLAG624003ef8 [2023-11-06 22:09:23,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/data/8046a0322/f24bf5e9ab544c55b0b5006beda3a461 [2023-11-06 22:09:23,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:09:23,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:09:23,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:23,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:09:23,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:09:23,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f399fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23, skipping insertion in model container [2023-11-06 22:09:23,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:09:23,702 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-06 22:09:23,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:09:23,723 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:09:23,763 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-06 22:09:23,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:09:23,781 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:09:23,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23 WrapperNode [2023-11-06 22:09:23,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:23,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:09:23,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:09:23,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:09:23,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,855 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2023-11-06 22:09:23,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:09:23,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:09:23,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:09:23,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:09:23,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:09:23,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:09:23,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:09:23,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:09:23,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (1/1) ... [2023-11-06 22:09:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:23,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:23,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:09:23,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:09:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:09:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:09:23,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:09:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:09:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-06 22:09:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-06 22:09:24,058 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:09:24,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:09:24,492 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:09:24,504 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:09:24,504 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:09:24,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:09:24 BoogieIcfgContainer [2023-11-06 22:09:24,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:09:24,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:09:24,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:09:24,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:09:24,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:09:23" (1/3) ... [2023-11-06 22:09:24,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d6c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:09:24, skipping insertion in model container [2023-11-06 22:09:24,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:23" (2/3) ... [2023-11-06 22:09:24,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d6c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:09:24, skipping insertion in model container [2023-11-06 22:09:24,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:09:24" (3/3) ... [2023-11-06 22:09:24,520 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2023-11-06 22:09:24,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:09:24,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:09:24,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:09:24,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7958757b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:09:24,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:09:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-06 22:09:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-11-06 22:09:24,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:24,665 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:24,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:24,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1564691013, now seen corresponding path program 1 times [2023-11-06 22:09:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287739376] [2023-11-06 22:09:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:09:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:09:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:09:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:09:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:09:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:09:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:09:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:09:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:09:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:09:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:09:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:09:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:09:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:09:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:09:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:09:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:09:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:09:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:09:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:09:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:09:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:09:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:09:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:09:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:09:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 22:09:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-06 22:09:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-06 22:09:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-06 22:09:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-06 22:09:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-06 22:09:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-06 22:09:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 22:09:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-06 22:09:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-06 22:09:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-06 22:09:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 22:09:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-06 22:09:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-06 22:09:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-06 22:09:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-06 22:09:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-06 22:09:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 22:09:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-06 22:09:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-06 22:09:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-06 22:09:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-06 22:09:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-06 22:09:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-06 22:09:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-06 22:09:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-06 22:09:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2023-11-06 22:09:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-11-06 22:09:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-11-06 22:09:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-06 22:09:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2023-11-06 22:09:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-11-06 22:09:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-06 22:09:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-06 22:09:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-06 22:09:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-11-06 22:09:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2023-11-06 22:09:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-11-06 22:09:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-11-06 22:09:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-11-06 22:09:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2023-11-06 22:09:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-11-06 22:09:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2023-11-06 22:09:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-11-06 22:09:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2023-11-06 22:09:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2023-11-06 22:09:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2023-11-06 22:09:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-11-06 22:09:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2023-11-06 22:09:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2023-11-06 22:09:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-11-06 22:09:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2023-11-06 22:09:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2023-11-06 22:09:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2023-11-06 22:09:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2023-11-06 22:09:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2023-11-06 22:09:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2023-11-06 22:09:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2023-11-06 22:09:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2023-11-06 22:09:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2023-11-06 22:09:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2023-11-06 22:09:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2023-11-06 22:09:25,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:25,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287739376] [2023-11-06 22:09:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287739376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:09:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765388450] [2023-11-06 22:09:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:25,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:09:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:09:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:09:25,846 INFO L87 Difference]: Start difference. First operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-11-06 22:09:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:25,909 INFO L93 Difference]: Finished difference Result 232 states and 488 transitions. [2023-11-06 22:09:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:09:25,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 455 [2023-11-06 22:09:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:25,923 INFO L225 Difference]: With dead ends: 232 [2023-11-06 22:09:25,923 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:09:25,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:09:25,936 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:25,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:09:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-06 22:09:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 28 states have (on average 1.0) internal successors, (28), 28 states have internal predecessors, (28), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-06 22:09:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2023-11-06 22:09:26,028 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 455 [2023-11-06 22:09:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:26,028 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2023-11-06 22:09:26,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-11-06 22:09:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2023-11-06 22:09:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-11-06 22:09:26,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:26,047 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:09:26,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:26,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1305604715, now seen corresponding path program 1 times [2023-11-06 22:09:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23616266] [2023-11-06 22:09:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:09:32,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:09:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:09:33,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:09:33,630 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:09:33,633 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:09:33,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:09:33,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:09:33,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:09:33,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:09:33 BoogieIcfgContainer [2023-11-06 22:09:33,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:09:33,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:09:33,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:09:33,853 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:09:33,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:09:24" (3/4) ... [2023-11-06 22:09:33,855 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:09:34,057 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:09:34,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:09:34,058 INFO L158 Benchmark]: Toolchain (without parser) took 10625.29ms. Allocated memory was 127.9MB in the beginning and 358.6MB in the end (delta: 230.7MB). Free memory was 83.4MB in the beginning and 255.4MB in the end (delta: -172.1MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,059 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:09:34,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.00ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 70.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.69ms. Allocated memory is still 127.9MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,060 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 127.9MB. Free memory was 68.3MB in the beginning and 67.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,061 INFO L158 Benchmark]: RCFGBuilder took 618.72ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 67.0MB in the beginning and 156.1MB in the end (delta: -89.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,062 INFO L158 Benchmark]: TraceAbstraction took 9340.82ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 155.2MB in the beginning and 267.0MB in the end (delta: -111.8MB). Peak memory consumption was 220.5MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,063 INFO L158 Benchmark]: Witness Printer took 204.59ms. Allocated memory is still 358.6MB. Free memory was 267.0MB in the beginning and 255.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:09:34,066 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.00ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 70.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.69ms. Allocated memory is still 127.9MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 127.9MB. Free memory was 68.3MB in the beginning and 67.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 618.72ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 67.0MB in the beginning and 156.1MB in the end (delta: -89.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9340.82ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 155.2MB in the beginning and 267.0MB in the end (delta: -111.8MB). Peak memory consumption was 220.5MB. Max. memory is 16.1GB. * Witness Printer took 204.59ms. Allocated memory is still 358.6MB. Free memory was 267.0MB in the beginning and 255.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 159]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 7) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=6] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 7) VAL [dummy=0, var0=3, var1=6] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 7) VAL [dummy=0, var0=3, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=3, var10=7, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 7) VAL [dummy=0, var0=3, var10=7, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=3, var10=7, var11=5, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 7) VAL [dummy=0, var0=3, var10=7, var11=5, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 7) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var13=1, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 7) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var13=1, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 7) VAL [dummy=0, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L87] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var8 != var13) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var8 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=3] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=3] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=6] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=6] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=7] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=7] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=5] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=5] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=2] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=2] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=1] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=1] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=4] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=4] [L159] reach_error() VAL [dummy=0, myvar0=1, var0=3, var10=7, var11=5, var12=2, var13=1, var14=4, var1=6, var2=0, var3=7, var4=2, var5=4, var6=5, var7=1, var8=3, var9=6, var_for_abs=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 200 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14620/14620 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 proved your program to be incorrect! [2023-11-06 22:09:34,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdab52e-8fd1-4283-8021-e6f03971e2a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE